Decompositions of ~n and H. Using Symmetric Chains
نویسنده
چکیده
We review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decomposition of Nn, and explain how it can be used to find a maximal collection of disjoint symmetric chains in the nonsymmetric lattice of partitions of a set.
منابع مشابه
Gray codes and symmetric chains
We consider the problem of constructing a cyclic listing of all bitstrings of length 2n+1 with Hamming weights in the interval [n+1−`, n+`], where 1 ≤ ` ≤ n+1, by flipping a single bit in each step. This is a far-ranging generalization of the wellknown middle two levels problem (the case ` = 1). We provide a solution for the case ` = 2 and solve a relaxed version of the problem for general valu...
متن کاملDecompositions of the Boolean Lattice into Rank-symmetric Chains
The Boolean lattice 2[n] is the power set of [n] ordered by inclusion. A chain c0 ⊂ · · · ⊂ ck in 2[n] is rank-symmetric, if |ci|+ |ck−i| = n for i = 0, . . . , k; and it is symmetric, if |ci| = (n− k)/2 + i. We prove that there exist a bijection p : [n] → [n] and a partial ordering < on [n](>n/2) satisfying the following properties: • ⊂ is an extension of < on [n](>n/2); • if C ⊂ [n](>n/2) is ...
متن کاملSymmetric Chain Decompositions of Quotients of Chain Products by Wreath Products
Subgroups of the symmetric group Sn act on powers of chains C n by permuting coordinates, and induce automorphisms of the ordered sets C. The quotients defined are candidates for symmetric chain decompositions. We establish this for some families of groups in order to enlarge the collection of subgroups G of the symmetric group Sn for which the quotient Bn/G obtained from the G-orbits on the Bo...
متن کاملOn the Volume of µ-way G-trade
A $ mu $-way $ G $-trade ($ mu geq 2) $ consists of $ mu $ disjoint decompositions of some simple (underlying) graph $ H $ into copies of a graph $ G. $ The number of copies of the graph $ G $ in each of the decompositions is the volume of the $ G $-trade and denoted by $ s. $ In this paper, we determine all values $ s $ for which there exists a $ mu $-way $ K_{1,m} $-trade of vo...
متن کاملHosoya polynomials of random benzenoid chains
Let $G$ be a molecular graph with vertex set $V(G)$, $d_G(u, v)$ the topological distance between vertices $u$ and $v$ in $G$. The Hosoya polynomial $H(G, x)$ of $G$ is a polynomial $sumlimits_{{u, v}subseteq V(G)}x^{d_G(u, v)}$ in variable $x$. In this paper, we obtain an explicit analytical expression for the expected value of the Hosoya polynomial of a random benzenoid chain with $n$ hexagon...
متن کامل